Axiomatic System for Order Dependencies
نویسندگان
چکیده
Dependencies play an important role in database theory. We study order dependencies (ODs) and unidirectional order dependencies (UODs), which describe the relationships among lexicographical orderings of sets of tuples. We investigate the axiomatization problem for order
منابع مشابه
Process Algebra Having Inherent Choice : Revised Semantics for Concurrent Systems 1
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel composition introduces resolvable nondeterminism, i.e., nondeterminism that will be resolved in later design phases or by the operating system. Sometimes it is also important to express inherent nondeterminism for equa...
متن کاملOn Time-Invariance and Synchronism in Valid-Time Relational Databases
We propose new temporal dependencies for valid-time relations. The proposed dependencies can be thought of as generalizations of the temporal database concept of time-invariant attribute. They are natural extensions of the conventional construct of functional dependency. A complete axiomatization is obtained by extending Armstrong's axioms. The new dependencies can be expressed in a first-order...
متن کاملA Complete Axiomatization of Full Acyclic Join Dependencies
A sound and complete formal system for full acyclic join dependencies is obtained by adding three derivation rules to the axioms of multivalued dependencies. 0 1998 Elsevier Science B.V. All rights reserved.
متن کاملReasoning About Embedded Dependencies Using Inclusion Dependencies
The implication problem for the class of embedded dependencies is undecidable. However, this does not imply lackness of a proof procedure as exemplified by the chase algorithm. In this paper we present a complete axiomatization of embedded dependencies that is based on the chase and uses inclusion dependencies and implicit existential quantification in the intermediate steps of deductions.
متن کاملFunctional Dependencies with Counting on Trees
The paper presents an axiomatisation for functional dependencies on trees that are defined using constructors for records, lists, sets and multisets. A simple form of restructuring permitting lists to be mapped onto multisets and multisets onto sets is added to the theory. Furthermore, the theory handles dependencies on sets treated as multisets. This adds the possibility to use the count of el...
متن کامل